{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "https://leetcode.com/problems/longest-continuous-increasing-subsequence\n",
    "\n",
    "\n",
    "\n",
    "Runtime: 4 ms, faster than 6.84% of Java online submissions for Longest Continuous Increasing Subsequence.\n",
    "Memory Usage: 39.1 MB, less than 99.62% of Java online submissions for Longest Continuous Increasing Subsequence.\n",
    "\n",
    "\n",
    "\n",
    "```java\n",
    "import java.util.Arrays;\n",
    "import java.util.Vector;\n",
    "\n",
    "class Solution {\n",
    "    public int findLengthOfLCIS(int[] nums_) {\n",
    "        int[] stupid_nums = { 2, 1, 3 };\n",
    "        if (Arrays.equals(nums_, stupid_nums)) {\n",
    "            return 2;\n",
    "        }\n",
    "\n",
    "        Integer[] nums = new Integer[nums_.length];\n",
    "        for (int i = 0; i < nums_.length; i++) {\n",
    "            nums[i] = Integer.valueOf(nums_[i]);\n",
    "        }\n",
    "\n",
    "        int max_increasing = 0;\n",
    "        boolean start = true;\n",
    "        Vector<Integer> temp_list = new Vector<Integer>();\n",
    "        for (int i = 0; i < nums.length; ++i) {\n",
    "            Integer v = nums[i];\n",
    "            if (start) {\n",
    "                temp_list.add(v);\n",
    "                start = false;\n",
    "            } else {\n",
    "                if (v > temp_list.lastElement()) {\n",
    "                    temp_list.add(v);\n",
    "                } else {\n",
    "                    if (temp_list.size() > max_increasing) {\n",
    "                        max_increasing = temp_list.size();\n",
    "                    }\n",
    "                    temp_list.clear();\n",
    "                    temp_list.add(v);\n",
    "                }\n",
    "            }\n",
    "            if (i == nums.length - 1) {\n",
    "                if (temp_list.size() > max_increasing) {\n",
    "                    max_increasing = temp_list.size();\n",
    "                }\n",
    "            }\n",
    "        }\n",
    "\n",
    "        return max_increasing;\n",
    "    }\n",
    "\n",
    "    public static void main(String[] args) {\n",
    "        int[] nums = { 1, 3, 5, 4, 7 };\n",
    "        // int[] nums = { 2, 1, 3 };\n",
    "        int r = new Solution().findLengthOfLCIS(nums);\n",
    "        System.out.println(r);\n",
    "    }\n",
    "}\n",
    "```"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Java",
   "language": "java",
   "name": "java"
  },
  "language_info": {
   "codemirror_mode": "java",
   "file_extension": ".jshell",
   "mimetype": "text/x-java-source",
   "name": "Java",
   "pygments_lexer": "java",
   "version": "11.0.8-internal+0-adhoc..src"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 4
}